From Weak Satissability to N-satissability on Hypergraphs
نویسنده
چکیده
In this paper we generalize Kolany's 11] and Cowen's 5] notions of satissability on hy-pergraphs. The notion of n-satissability on hypergraphs is developed. We show that the compactness property of n-satissability on hypergraphs is, in ZF set theory, equivalent to the Prime Ideal theorem in Boolean algebra. We give a syntactic characterization of n-satissability on hypergraphs in terms of a resolution style proof procedure. Consequence relations based on hypergraphs are also introduced and studied.
منابع مشابه
Undecidability Results on Two-Variable Logics
It is a classical result of Mortimer that L 2 , rst-order logic with two variables, is decidable for satissability. We show that going beyond L 2 by adding any one of the following leads to an undecidable logic: very weak forms of recursion, viz. (i) transitive closure operations (ii) (restricted) monadic xed-point operations weak access to cardinalities, through the HH artig (or equicardinalit...
متن کاملThe phase transition in random Horn satis
This paper studies the phase transition in random Horn satissability: under the random model (n; m) in which a formula is obtained by choosing m clauses independently, uniformly at random, and with repetition from all Horn clauses in n variables, (n) = 2 n is the satissability threshold for the Horn satissability. The threshold is coarse since, if (n) = c 2 n then lim n!1 Pr 2(n;;(n)) is satiss...
متن کاملGenerating Hard Satissability Problems ?
We report results from large-scale experiments in satissability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satissability testing is quite diicult....
متن کاملLearning from Satissability
A formalisation of concept-learning in logic is presented under the name learning from satissability. It generalizes learning from entailment as employed in inductive logic programming and learning from interpretations as used in attribute-value learning. When learning from satissability, examples and hypotheses are both clausal theories , and a hypothesis covers an example if the conjunction o...
متن کاملPlanning as Satissability
We develop a formal model of planning based on satissability rather than deduction. The satissability approach not only provides a more ex-ible framework for stating diierent kinds of constraints on plans, but also more accurately reeects the theory behind modern constraint-based planning systems. Finally, we consider the computational characteristics of the resulting formulas, by solving them ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998